Input and Output of Instructions

In this paper N is a set with non empty elements. One can prove the following propositions: (1) For all sets x, y, z such that x 6= y and x 6= z holds {x, y, z}\{x} = {y, z}. (2) For every non empty non void AMI A over N and for every state s of A and for every object o of A holds s(o) ∈ ObjectKind(o). (3) Let A be a realistic IC-Ins-separated definite non empty non void AMI over N , s be a state of A, f be an instruction-location of A, and w be an element of ObjectKind(ICA). Then (s +· (ICA, w))(f) = s(f). Let N be a set with non empty elements, let A be an IC-Ins-separated definite non empty non void AMI over N , let s be a state of A, let o be an object of A, and let a be an element of ObjectKind(o). Then s+· (o, a) is a state of A. We now state several propositions: (4) Let A be a steady-programmed IC-Ins-separated definite non empty non void AMI over N , s be a state of A, o be an object of A, f be an instruction-location of A, I be an instruction of A, and w be an element of ObjectKind(o). If f 6= o, then (Exec(I, s))(f) = (Exec(I, s +· (o, w)))(f).